complete graph - определение. Что такое complete graph
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое complete graph - определение

SIMPLE UNDIRECTED GRAPH IN WHICH EVERY PAIR OF DISTINCT VERTICES IS CONNECTED BY A UNIQUE EDGE
Full graph; Complete Digraph; Complete digraph; K n; Tetrahedral Graph; Complete graphs

complete graph         
A graph which has a link between every pair of nodes. A complete bipartite graph can be partitioned into two subsets of nodes such that each node is joined to every node in the other subset. (1995-01-24)
Complete bipartite graph         
  • 120px
  • 120px
  • 120px
  • 120px
  • 120px
  • 120px
  • 1,6}}}}.
  • 4,7}}}} showing that [[Turán's brick factory problem]] with 4 storage sites (yellow spots) and 7 kilns (blue spots) requires 18 crossings (red dots)
EVERY VERTEX OF FIRST SET ATTACHED TO EVERY VERTEX OF SECOND SET
Biclique; Complete bigraph
In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set... Electronic edition, page 17.
Null graph         
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").

Википедия

Complete graph

In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction).

Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, had already appeared in the 13th century, in the work of Ramon Llull. Such a drawing is sometimes referred to as a mystic rose.